A Coordination-Based Framework for Distributed Constraint Solving

نویسنده

  • Peter Zoeteweij
چکیده

This paper gives an overview of DICE (DIstributed Constraint Environment), a framework for the construction of distributed constraint solvers from software components in four categories: (1) variable domain types, (2) (incomplete) solvers, (3) splitting strategies, to build search trees, and (4) search strategies, to traverse these search trees. DICE is implemented using the Manifold coordination language, and coordinates the components of a distributed solver. In addition to the coordination protocols and the algorithms that they implement, the paper describes the construction of solvers both from a constraint programming and a software engineering point of view.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Software ENgineering A coordination-based framework for distributed constraint solving

DICE (DIstributed Constraint Environment) is a framework for the construction of distributed constraint solvers from software components in a number of predefined categories. The framework is implemented using the Manifold coordination language, and coordinates the components of a distributed solver by means of coordination protocols that implement a distributed constraint propagation algorithm...

متن کامل

OpenSolver: A Coordination-Enabled Abstract Branch-and-Prune Tree Search Engine

Coordination programming deals with building complex software systems from largely autonomous component systems. Cooperative constraint solving (see for example [1]), which is widely recognized as a means to improve efficiency of constraint solving, is an area that may benefit from techniques developed in coordination programming, because the solvers that we want to combine are generally autono...

متن کامل

Efficient and distributable methods for solving the multiagent plan coordination problem

Coordination can be required whenever multiple agents plan to achieve their individual goals independently, but might mutually benefit by coordinating their plans to avoid working at cross purposes or duplicating effort. Although variations of such problems have been studied in the literature, there is as yet no agreement over a general characterization of them. In this paper, we formally defin...

متن کامل

Optimal Combined and Adaptive Protection of Active Distribution Networks Considering Different System Topologies Incorporating Optimal Selection of Standard Relay Curves

The change in the topology of active distribution networks (ADNs) is one of the essential challenges that might affect the protection schemes. The conventional protection schemes based on base topology result in some coordination constraint violations in other topologies due to the outage of upstream substations and distributed generation units. In this article, new combinational and adaptive p...

متن کامل

Multiagent Coordination Using Graph Structured Mathematical Optimization

We address the problem of solving mathematical programs defined over a graph where nodes represent agents and edges represent interaction among agents. We focus on the class of graph structured linear and quadratic programs (LPs/QPs) which can model important multiagent coordination frameworks such as distributed constraint optimization (DCOP). For DCOPs, our framework provides a key benefit of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002